#include <stdio.h>

bool primes[1000010];
int n;
int p;
int fl;

void sieve() {
	p=2;

	for (int i=0; i<=1000000; i++)
		primes[i]=true;

	while (p*p<=1000000) {
		for (int i=2; i*p<=1000000; i++)
			primes[i*p]=false;

		while (!primes[++p])
			if (p*p>1000000) break;
	}
}

int main() {
	sieve();

	while (1) {
		scanf("%d", &n);
		if (!n) break;
		fl=0;

		for (int i=3; i<n; i++) {
			if (primes[i] && primes[n-i]) {
				printf("%d = %d + %d\n", n, i, n-i);
				fl=1; break;
			}
		}

		if (!fl) printf("Goldbach's conjecture is wrong.\n");	
	}

	return 0;
}
